Firefly algorithm and ant colony algorithm to optimize the traveling salesman problem

Abstract Through the study of ACOTSP, it is found that previous ant colony algorithm will fall into local optimal when increasing pheromone concentration factor. In order to solve problem, we through improved factor view your traveling salesman solving process, simulation experiments due gradually increased with number iterations, and exponential relationship, lead appear even if distance large move also can probability very high. this design, optimized by introducing firefly (FA): movement deviation avoided adding disturbance factor; migration caused excessive solved function relation between moving concentration. Simulation results show has better not easy optimum.